Search results for "prajective unifier"

Projective unification in transitive modal logics

2018

We show that a transitive normal modal logic L enjoys projective unification (i.e. each unifiable formula is projective) if and only if L contains K4D1 ( D1 : ( x → y ) ∨ ( y → x ) ). It means, in particular, that K4D1 (and any of its extensions) is almost structurally complete, i.e. the logic is complete with respect to all non-passive admissible rules. We also characterize non-unifiable formulas and provide an explicit form of the basis for all passive rules over K4G + ( x → x )